Backtrack-Free Search for Resource Allocation Problems
نویسندگان
چکیده
Freuder 9] has previously given conditions that guarantee backtrack-free search when solving binary constraint networks. Freuder's condition relies on the \width" of the constraint network. Computing the width of a constraint network involves minimizing over all possible orderings of the vertices in the network. This paper presents an similar result for backtrack-free search when solving resource allocation problems. Our result uses a measure analogous to width that can be computed more easily.
منابع مشابه
An Empirical Study of a New Restart Strategy for Randomized Backtrack Search
We propose an improved restart strategy for randomized backtrack search and compare its performance to other search mechanisms in the context of solving a tight real-world resource allocation problem. The restart strategy proposed by Gomes et al. [1] requires the specification of a cutoff value determined from an overall profile of the cost of search for solving the problem. When no such profil...
متن کاملCharacterization of a New Restart Strategy for Randomized Backtrack Search
We propose an improved restart strategy for randomized backtrack search, and evaluate its performance by comparing to other heuristic and stochastic search techniques for solving random problems and a tight real-world resource allocation problem. The restart strategy proposed by Gomes et al. [1] requires the specification of a cutoff value determined from an overall profile of the cost of searc...
متن کاملA Multi Objective Fibonacci Search Based Algorithm for Resource Allocation in PERT Networks
The problem we investigate deals with the optimal assignment of resources to the activities of a stochastic project network. We seek to minimize the expected cost of the project include sum of resource utilization costs and lateness costs. We assume that the work content required by the activities follows an exponential distribution. The decision variables of the model are the allocated resourc...
متن کاملA Revised Su cient Condition for Backtrack-Free Search
In this paper, we deene the notion of !-consistency and !-graph associated with general n-ary constraint satisfaction problems and present an alternative suu-cient condition for backtrack-free search; that is, if the hypergraph associated with a general CSP has a tree-structured !-graph, then enforcing !-consistency enables the CSP to be solved by search without backtracking. We then show that ...
متن کاملExact phase transition of backtrack-free search with implications on the power of greedy algorithms
Backtracking is a basic strategy to solve constraint satisfaction problems (CSPs). A satisfiable CSP instance is backtrack-free if a solution can be found without encountering any dead-end during a backtracking search, implying that the instance is easy to solve. We prove an exact phase transition of backtrack-free search in some random CSPs, namely in Model RB and in Model RD. This is the firs...
متن کامل